Invariant subspace , determinant and characteristic polynomials ∗
نویسنده
چکیده
Making use of an elementary fact on invariant subspace and determinant of a linear map and the method of algebraic identities, we obtain a factorization formula for a general characteristic polynomial of a matrix. This answers a question posed in [A. Deng, I. Sato, Y. Wu, Characteristic polynomials of ramified uniform covering digraphs, European Journal of Combinatorics 28 (2007), 1099–1114]. The approach of this work can be used to supply alternative proofs of several other earlier results, including some results of [Y. Teranishi, Equitable switching and spectra of graphs, Linear Algebra and its Applications 359 (2003), 121–131]. 1991 AMS Subject Classification: 05C50
منابع مشابه
Weak*-closed invariant subspaces and ideals of semigroup algebras on foundation semigroups
Let S be a locally compact foundation semigroup with identity and be its semigroup algebra. Let X be a weak*-closed left translation invariant subspace of In this paper, we prove that X is invariantly complemented in if and only if the left ideal of has a bounded approximate identity. We also prove that a foundation semigroup with identity S is left amenab...
متن کاملInvariants and polynomial identities for higher rank matrices
We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct discriminants and the determinant as the discriminant of order d, where d is the dimension of the matrix. The characteristic polynomials and the Cayley–Hamilton th...
متن کاملInteractive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices
Certificates to a linear algebra computation are additional data structures for each output, which can be used by a—possibly randomized— verification algorithm that proves the correctness of each output. Wiedemann’s algorithm projects the Krylov sequence obtained by repeatedly multiplying a vector by a matrix to obtain a linearly recurrent sequence. The minimal polynomial of this sequence divid...
متن کاملQuasi-Exactly Solvable Hamiltonians related to Root Spaces
sl(2)−Quasi-Exactly-Solvable (QES) generalization of the rationalAn, BCn, G2, F4, E6,7,8 Olshanetsky-Perelomov Hamiltonians including many-body Calogero Hamiltonian is found. This generalization has a form of anharmonic perturbations and it appears naturally when the original rational Hamiltonian is written in a certain Weyl-invariant polynomial variables. It is demonstrated that for the QES Ha...
متن کاملDeterminants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007